A Reputation Search Mechanism Based on Ant Colony and Grouping ⋆
نویسندگان
چکیده
In reputation systems, how to obtain node’s reputation is a crucial issue. To solve this problem, a two-layer reputation search mechanism based on ant colony and grouping is proposed. The first layer is the monitoring platform. According to physical topology, it divides nodes into groups. Each group uses network segment as its identification, and it has a super node and a candidate node. The second layer includes a group management module and an ant colony algorithm. A source node sends its request to the monitoring platform. The latter checks whether the source node and destination node are in the same group. If it is met, the destination node’s reputation will be searched in the group with the ant colony algorithm. Otherwise, this algorithm is used to find the super node in the group of the source node firstly. Then the algorithm is used to locate destination group among super nodes. Lastly, the required reputation is obtained. Simulation results show that the proposed mechanism can shorten search distance and search time effectively.
منابع مشابه
New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملCombining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملUnstructured P2P Search Mechanism Based on Ant Colony Optimization
Though flooding-based search mechanism has been used extensively in unstructured peer-to-peer network such as Gnutella, the mechanism is not scalable and as a consequence, it consumes a high amount bandwidths and resources. Because of the strong similarities between self-organizing behaviors of ant colonies and self-organization communications in P2P networks, a search algorithm based on Ant Co...
متن کاملAutomatic Test Paper Generation Based on Ant Colony Algorithm
Traditional method of test paper generation is time-consuming, low efficient and low success. In order to improve the success rate of test paper, the paper puts forward an ant colony algorithm of automatic sets method. First, a mathematical model of constraint is built according to the requires of papers, and by using the ant colony algorithm, the optimal solution of grouping is obtained. Simul...
متن کامل